Hotel Performance in the UK: The Role of Information Entropy in a Novel Slack-Based Data Envelopment Analysis

Previous hotel performance studies neglected the role of information entropy in feedback processes between input and output management. This paper focuses on this gap by exploring the relationship between hotel performance at the industry level and the capability of learning by doing and adopting best practices using a sample of 153 UK hotels over a 10-year period between 2008–2017. Besides, this research also fills a literature gap by addressing the issues of measuring hotel performance in light of negative outputs. In order to achieve this, we apply a novel Modified slack-based model for the efficiency analysis and Least Absolute Shrinkage and Selection Operator to examine the influence of entropy related variable on efficiency score. The Results indicate that less can be learnt from inputs than from outputs to improve efficiency levels and resource allocation is more balanced than cash flow and liquidity. The findings suggest that market dynamics explains the cash flow generation potential and liquidity. We find that market conditions are increasingly offering the opportunities for learning and improving hotel efficiency. The results report that the distinctive characteristic of superior performance in hotel operations is the capability to match the cash flow generation potential with market opportunities.     

Multiple Observations for Secret-Key Binding with SRAM PUFs

We present a new Multiple-Observations (MO) helper data scheme for secret-key binding to an SRAM-PUF. This MO scheme binds a single key to multiple enrollment observations of the SRAM-PUF. Performance is improved in comparison to classic schemes which generate helper data based on a single enrollment observation. The performance increase can be explained by the fact that the reliabilities of the different SRAM cells are modeled (implicitly) in the helper data. We prove that the scheme achieves secret-key capacity for any number of enrollment observations, and, therefore, it is optimal. We evaluate performance of the scheme using Monte Carlo simulations, where an off-the-shelf LDPC code is used to implement the linear error-correcting code. Another scheme that models the reliabilities of the SRAM cells is the so-called Soft-Decision (SD) helper data scheme. The SD scheme considers the one-probabilities of the SRAM cells as an input, which in practice are not observable. We present a new strategy for the SD scheme that considers the binary SRAM-PUF observations as an input instead and show that the new strategy is optimal and achieves the same reconstruction performance as the MO scheme. Finally, we present a variation on the MO helper data scheme that updates the helper data sequentially after each successful reconstruction of the key. As a result, the error-correcting performance of the scheme is improved over time.     

Estimation of Feeding Composition of Industrial Process Based on Data Reconciliation

For an industrial process, the estimation of feeding composition is important for analyzing production status and making control decisions. However, random errors or even gross ones inevitably contaminate the actual measurements. Feeding composition is conventionally obtained via discrete and low-rate artificial testing. To address these problems, a feeding composition estimation approach based on data reconciliation procedure is developed. To improve the variable accuracy, a novel robust M-estimator is first proposed. Then, an iterative robust hierarchical data reconciliation and estimation strategy is applied to estimate the feeding composition. The feasibility and effectiveness of the estimation approach are verified on a fluidized bed roaster. The proposed M-estimator showed better overall performance.     

An Entropy-Based Approach to Measurement of Stock Market Depth

The aim of this study is to investigate market depth as a stock market liquidity dimension. A new methodology for market depth measurement exactly based on Shannon information entropy for high-frequency data is introduced and utilized. The proposed entropy-based market depth indicator is supported by an algorithm inferring the initiator of a trade. This new indicator seems to be a promising liquidity measure. Both market entropy and market liquidity can be directly measured by the new indicator. The findings of empirical experiments for real-data with a time stamp rounded to the nearest second from the Warsaw Stock Exchange (WSE) confirm that the new proxy enables us to effectively compare market depth and liquidity for different equities. Robustness tests and statistical analyses are conducted. Furthermore, an intra-day seasonality assessment is provided. Results indicate that the entropy-based approach can be considered as an auspicious market depth and liquidity proxy with an intuitive base for both theoretical and empirical analyses in financial markets.     

A Review on Machine Learning Approaches for Network Malicious Behavior Detection in Emerging Technologies

Network anomaly detection systems (NADSs) play a significant role in every network defense system as they detect and prevent malicious activities. Therefore, this paper offers an exhaustive overview of different aspects of anomaly-based network intrusion detection systems (NIDSs). Additionally, contemporary malicious activities in network systems and the important properties of intrusion detection systems are discussed as well. The present survey explains important phases of NADSs, such as pre-processing, feature extraction and malicious behavior detection and recognition. In addition, with regard to the detection and recognition phase, recent machine learning approaches including supervised, unsupervised, new deep and ensemble learning techniques have been comprehensively discussed; moreover, some details about currently available benchmark datasets for training and evaluating machine learning techniques are provided by the researchers. In the end, potential challenges together with some future directions for machine learning-based NADSs are specified.     

Status Set Sequential Pattern Mining Considering Time Windows and Periodic Analysis of Patterns

The traditional sequential pattern mining method is carried out considering the whole time period and often ignores the sequential patterns that only occur in local time windows, as well as possible periodicity. Therefore, in order to overcome the limitations of traditional methods, this paper proposes status set sequential pattern mining with time windows (SSPMTW). In contrast to traditional methods, the item status is considered, and time windows, minimum confidence, minimum coverage, minimum factor set ratios and other constraints are added to mine more valuable rules in local time windows. The periodicity of these rules is also analyzed. According to the proposed method, this paper improves the Apriori algorithm, proposes the TW-Apriori algorithm, and explains the basic idea of the algorithm. Then, the feasibility, validity and efficiency of the proposed method and algorithm are verified by small-scale and large-scale examples. In a large-scale numerical example solution, the influence of various constraints on the mining results is analyzed. Finally, the solution results of SSPM and SSPMTW are compared and analyzed, and it is suggested that SSPMTW can excavate the laws existing in local time windows and analyze the periodicity of the laws, which solves the problem of SSPM ignoring the laws existing in local time windows and overcomes the limitations of traditional sequential pattern mining algorithms. In addition, the rules mined by SSPMTW reduce the entropy of the system.     

QUANTIS: Data quality assessment tool by clustering analysis

Automatically generated kinetic networks are ideally validated against a large set of accurate, reproducible, and easy-to-model experimental data. However, although this might seem simple, it proves to be quite challenging. QUANTIS, a publicly available Python package, is specifically developed to evaluate both the precision and accuracy of experimental data and to ensure a uniform, quick processing, and storage strategy that enables automated comparison of developed kinetic models. The precision is investigated with two clustering techniques, PCA and t-SNE, whereas the accuracy is probed with checks for the conservation laws. First, the developed tool processes, evaluates, and stores experimental yield data automatically. All data belonging to a given experiment, both unprocessed and processed, are stored in the form of an HDF5 container. The demonstration of QUANTIS on three different pyrolysis cases showed that it can help in identifying and overcoming instabilities in experimental datasets, reduce mass and molar balance closure discrepancies, and, by evaluating the visualized correlation matrices, increase understanding in the underlying reaction pathways. Inclusion of all experimental data in the HDF5 file makes it possible to automate simulating the experiment with CHEMKIN. Because of the employed InChI string identifiers for molecules, it is possible to automate the comparison experiment/simulation. QUANTIS and the concepts demonstrated therein is a potentially useful tool for data quality assessment, kinetic model validation, and refinement.     

Global existence and time decay estimate of solutions to the Keller–Segel system

We consider the chemotaxis‐Navier–Stokes system 1.1-1.4 (Keller–Segel system) in the whole space, which describes the motion of oxygen‐driven bacteria, eukaryotes, in a fluid. We proved the global existence and time decay estimate of solutions to the Cauchy problem 1.1-1.2 in with the small initial data. Moreover, when the fluid motion is described by the Stokes equations, we established the global weak solutions to 1.3-1.4 in with the potential function ? is small and the initial density n₀(x) has finite mass.